#define _CRT_SECURE_NO_WARNINGS 1

#include "BinarySearchTree.h"

int main() 
{
	int a[] = { 13,4,5,6,24,43,21,12,16 };
	BSTree<int> bt;
	for (auto e : a)
	{
		bt.InSert(e);
		bt.InOrder();
	}

	BSTree<int> bt2(bt);
	bt2.InOrder();
	BSTree<int> bt3 = bt2;
	bt3.InOrder();
	return 0;
}
